Sharp Threshold Functions for Random Intersection Graphs via a Coupling Method
نویسنده
چکیده
We present a new method which enables us to find threshold functions for many properties in random intersection graphs. This method is used to establish sharp threshold functions in random intersection graphs for k–connectivity, perfect matching containment and Hamilton cycle containment.
منابع مشابه
How to obtain sharp threshold functions for the random intersection graph via coupling method?
We will present a new method, which enables us to find threshold functions for many properties in random intersection graphs. This method will be used to establish sharp threshold functions in random intersection graphs for k–connectivity, perfect matching containment and Hamilton cycle containment. keywords: random intersection graph, threshold functions, connectivity, Hamilton cycle, perfect ...
متن کاملThe Coupling Method for Inhomogeneous Random Intersection Graphs
We present new results concerning threshold functions for a wide family of random intersection graphs. To this end we improve and generalize the coupling method introduced for random intersection graphs so that it may be used for a wider range of parameters. Using the new approach we are able to tighten the best known results concerning random intersection graphs and establish threshold functio...
متن کاملA curious gap in one-dimensional geometric random graphs between connectivity and the absence of isolated node
One-dimensional geometric random graphs are constructed by distributing n nodes uniformly and independently on a unit interval and then assigning an undirected edge between any two nodes that have a distance at most rn. These graphs have received much interest and been used in various applications including wireless networks. A threshold of rn for connectivity is known as r∗ n = lnn n in the li...
متن کاملExpander Properties and the Cover Time of Random Intersection Graphs
We investigate important combinatorial and algorithmic properties of Gn,m,p random intersection graphs. In particular, we prove that with high probability (a) random intersection graphs are expanders, (b) random walks on such graphs are “rapidly mixing” (in particular they mix in logarithmic time) and (c) the cover time of random walks on such graphs is optimal (i.e. it is Θ(n log n)). All resu...
متن کاملOn the Isolated Vertices and Connectivity in Random Intersection Graphs
We study isolated vertices and connectivity in the random intersection graphG n,m, p . A Poisson convergence for the number of isolated vertices is determined at the threshold for absence of isolated vertices, which is equivalent to the threshold for connectivity. When m n and α > 6, we give the asymptotic probability of connectivity at the threshold for connectivity. Analogous results are well...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011